The Cascade Vulnerability Problem: the detection problem and a simulated annealing approach for its correction
نویسندگان
چکیده
The Cascade Vulnerability Problem is a potential problem which must be faced when using the interconnected accredited system approach of the Trusted Network Interpretation. It belongs to a subset of the problem set that addresses the issue of whether the interconnection of secure systems via a secure channel results in a secure distributed system. The Cascade Vulnerability problem appears when an adversary can take advantage of network connections to compromise information across a range of sensitivity levels that is greater than the accreditation range of any of the component systems s/he must defeat to do so. In this paper, we present the general Cascade vulnerability problem, describe the basic properties of the most important detection algorithms, conduct a brief comparative analysis, and present a new approach based on simulated annealing for its correction.
منابع مشابه
Simulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملA simulated annealing approach to solve the network design of one-way streets: case of Shiraz network
This study is devoted to the formulation of the network design problem of one-way streets and the application of simulated annealing (SA) algorithm to solve this problem for a large real network. It discusses some points of views on one-way street networks, the objective function used for design, the way in which design constraints may be considered, and the traffic problems concerning one-way ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Microprocessors and Microsystems - Embedded Hardware Design
دوره 21 شماره
صفحات -
تاریخ انتشار 1998